Decidability of equivalence for a class of non-deterministic tree transducers
نویسندگان
چکیده
منابع مشابه
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers
In this paper, we consider non-deterministic tree transducers in the letter to letter case, that is to say tree transducers for which trees which appear in the rules are reduced to one letter in the right-hand side as in the left one. We establish the decidability of equivalence for linear and non-deleting top-down transducers. These results are valid in the bottom-up case. R esum e Nous consid...
متن کاملThe Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
It is decidable for deterministic MSO definable graph-to-string or graphto-tree transducers whether they are equivalent on a context-free set of graphs. It is well known that the equivalence problem for nondeterministic (one-way) finite state transducers is undecidable, even when they cannot read or write the empty string [Gri68]. In contrast, equivalence is decidable for deterministic finite s...
متن کاملEquivalence of Symbolic Tree Transducers
Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop. As a consequence the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data v...
متن کاملMinimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many output...
متن کاملEquivalence Problems for Tree Transducers: A Brief Survey
The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable tree transducers, and (3) monadic input and output ranked alphabets. For the full class of MTTs, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1994
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1994280504471